Two-Variable Logic on 2-Dimensional Structures

This paper continues the study of the two-variable fragment of first-order logic (FO2) over twodimensional structures, more precisely structures with two orders, their induced successor relations and arbitrarily many unary relations. Our main focus is on ordered data words which are finite sequences from the set Σ×D where Σ is a finite alphabet and D is an ordered domain. These are naturally represented as labelled finite sets with a linear order ≤l and a total preorder ≤p . We introduce ordered data automata, an automaton model for ordered data words. An ordered data automaton is a composition of a finite state transducer and a finite state automaton over the product Boolean algebra of finite and cofinite subsets of N. We show that ordered data automata are equivalent to the closure of FO(+1l ,≤p ,+1p) under existential quantification of unary relations. Using this automaton model we prove that the finite satisfiability problem for this logic is decidable on structures where the ≤p -equivalence classes are of bounded size. As a corollary, we obtain that finite satisfiability of FO2 is decidable (and it is equivalent to the reachability problem of vector addition systems) on structures with two linear order successors and a linear order corresponding to one of the successors. Further we prove undecidability of FO2 on several other two-dimensional structures. 1998 ACM Subject Classification F.4.1 Mathematical Logic